The Taming of the (X)OR
نویسندگان
چکیده
Many key verification problems such as bounded model-checking, circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e. clauses with xor as the connective) and cannot be efficiently (if at all) solved by using CNF-only provers. We present a decision procedure to efficiently decide such problems. The GaussDPLL procedure is a tight integration in a unifying framework of a Gauss-Elimination procedure (for affine logic) and a Davis-Putnam-Logeman-Loveland procedure (for usual clause logic). The key idea, which distinguishes our approach from others, is the full interaction bewteen the two parts which makes it possible to maximize (deterministic) simplification rules by passing around newly created unit or binary clauses in either of these parts. We show the correcteness and the termination of Gauss-DPLL under very liberal assumptions.
منابع مشابه
First as Farce, Then as Filmfarsi: Film Adaptation of Shakespeare’s The Taming of the Shrew in Iran
This article is concerned with William Shakespeare’s famous farce play The Taming of the Shrew and its Persian adaptation as an Iranian film called Gorbe ra dame Hejleh Mikoshand in 1969. The point that informs the inquiry is the way the film departs and differs from the play in relation to the issue of women within the patriarchal society. The play and the film will be examined separately in d...
متن کاملRationally connected 3-folds and symplectic geometry
The first condition tells that ω is of type (1, 1). The last condition is called the taming condition. We will consider more generally taming symplectic forms α on X. These forms are thus non necessarily of type (1, 1) but their (1, 1)-part is positive (but not necessarily closed). Let X and Y be two complex projective or compact Kähler manifolds. The set of taming symplectic forms on X, resp. ...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملEffects of a Virtual Classroom in social media platform on the Knowledge of Emergency Department Interns: A Randomized Interventional Trial
Background: Emergency medicine has always been a leader in taming new technologies for medical education. Many forms of social media have been reported in medical education with very little quality evidence to clarify their role. In this study we look at a popular multimedia messaging application in our setting and the aim was to evaluate the effects of a virtual classroom in social media platf...
متن کاملAssessment of X-Ray Crosstalk in a Computed Tomography Scanner with Small Detector Elements Using Monte Carlo Method
Introduction: Crosstalk is a leakage of X-ray or light produced in a matrix of X-ray detectors or array of photodiodes in one element to other elements affecting on image contrast and spatial resolution. In this study, we assessed X-ray crosstalk in a computed tomography (CT) scanner with small detector elements to estimate the effect of various parameters such as X-ray tube voltage, detector e...
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کامل